Processing and Linking Audio Events in Large Multimedia Archives: The EU inEvent Project

In the inEvent EU project [1], we aim at structuring, retrieving, and sharing large archives of networked, and dynamically changing, multimedia recordings, mainly consisting of meetings, videoconferences, and lectures. More specifically, we are developing an integrated system that performs audiovisual processing of multimedia recordings, and labels them in terms of interconnected “hyper-events ” (a notion inspired from hyper-texts). Each hyper-event is composed of simpler facets, including audio-video recordings and metadata, which are then easier to search, retrieve and share. In the present paper, we mainly cover the audio processing aspects of the system, including speech recognition, speaker diarization and linking (across recordings), the use of these features for hyper-event indexing and recommendation, and the search portal. We present initial results for feature extraction from lecture recordings using the TED talks. Index Terms: Networked multimedia events; audio processing: speech recognition; speaker diarization and linking; multimedia indexing and searching; hyper-events. 1

New Results on Optimizing Rooted Triplets Consistency

A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related optimization problems called the maximum rooted triplets consistency problem (\textsc{MaxRTC}) and the minimum rooted triplets inconsistency problem (\textsc{MinRTI}) in which the input is a set $\mathcal{R}$ of rooted triplets, and where the objectives are to find a largest cardinality subset of $\mathcal{R}$ which is consistent and a smallest cardinality subset of $\mathcal{R}$ whose removal from $\mathcal{R}$ results in a consistent set, respectively. We first show that a simple modification to Wu’s Best-Pair-Merge-First heuristic [25] results in a bottom-up-based 3-approximation for \textsc{MaxRTC}. We then demonstrate how any approximation algorithm for \textsc{MinRTI} could be used to approximate \textsc{MaxRTC}, and thus obtain the first polynomial-time approximation algorithm for \textsc{MaxRTC} with approximation ratio smaller than 3. Next, we prove that f

Completeness Results for Parameterized Space Classes

The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have, however, resisted such a classification. At least in some cases, the reason is that upper and lower bounds for their parameterized space complexity have recently been obtained that rule out completeness results for parameterized time classes. In this paper, we make progress in this direction by proving that the associative generability problem and the longest common subsequence problem are complete for parameterized space classes. These classes are defined in terms of different forms of bounded nondeterminism and in terms of simultaneous time--space bounds. As a technical tool we introduce a "union operation" that translates between problems complete for classical complexity classes and for W-classes.Comment: IPEC 201

Finding and counting vertex-colored subtrees

The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a given multiset of colors $M$. It is a graph pattern-matching problem variant, where the structure of the occurrence of the pattern is not of interest but the only requirement is the connectedness. Using an algebraic framework recently introduced by Koutis et al., we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, proving that the counting problem is FPT if M is a set, but becomes W[1]-hard if M is a multiset with two colors. Finally, we present an experimental evaluation of this approach on real datasets, showing that its performance compares favorably with existing software.Comment: Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in Algorithmic

Five New Millisecond Pulsars From a Radio Survey of 14 Unidentified Fermi-LAT Gamma-ray Sources

We have discovered five millisecond pulsars (MSPs) in a survey of 14 unidentified Fermi-LAT sources in the southern sky using the Parkes radio telescope. PSRs J0101-6422, J1514-4946, and J1902-5105 reside in binaries, while PSRs J1658-5324 and J1747-4036 are isolated. Using an ephemeris derived from timing observations of PSR J0101-6422 (P =2.57 ms, DM=12 pc cm-3), we have detected {\gamma}-ray pulsations and measured its proper motion. Its {\gamma}-ray spectrum (a power law of {\Gamma} = 0.9 with a cutoff at 1.6 GeV) and efficiency are typical of other MSPs, but its radio and {\gamma}-ray light curves challenge simple geometric models of emission. The high success rate of this survey-enabled by selecting {\gamma}-ray sources based on their detailed spectral characteristics-and other similarly successful searches indicate that a substantial fraction of the local population of MSPs may soon be known.Comment: 6 pages, 3 figures, 2 tables, accepted by ApJ

Polynomial kernelization for removing induced claws and diamonds

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique. In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edges from $G$ to obtain a (claw,diamond)-free graph. Our main result is that this problem admits a polynomial kernel. We complement this finding by proving that, even on instances with maximum degree $6$, the problem is NP-complete and cannot be solved in time $2^{o(k)}\cdot |V(G)|^{O(1)}$ unless the Exponential Time Hypothesis fai

Radio Detection of the Fermi LAT Blind Search Millisecond Pulsar J1311-3430

We report the detection of radio emission from PSR J1311-3430, the first millisecond pulsar discovered in a blind search of Fermi Large Area Telescope (LAT) gamma-ray data. We detected radio pulsations at 2 GHz, visible for <10% of ~4.5-hrs of observations using the Green Bank Telescope (GBT). Observations at 5 GHz with the GBT and at several lower frequencies with Parkes, Nancay, and the Giant Metrewave Radio Telescope resulted in non-detections. We also report the faint detection of a steep spectrum continuum radio source (0.1 mJy at 5 GHz) in interferometric imaging observations with the Jansky Very Large Array. These detections demonstrate that PSR J1311-3430, is not radio quiet and provides additional evidence that the radio beaming fraction of millisecond pulsars is very large. The radio detection yields a distance estimate of 1.4 kpc for the system, yielding a gamma-ray efficiency of 30%, typical of LAT-detected MSPs. We see apparent excess delay in the radio pulsar as the pulsar appears from eclipse and we speculate on possible mechanisms for the non-detections of the pulse at other orbital phases and observing frequencies.Comment: 6 pages, 4 figures. ApJ Letters, in pres

Hes1 and Hes5 activities are required for the normal development of the hair cells in the mammalian inner ear.

The mammalian inner ear contains two sensory organs, the cochlea and vestibule. Their sensory neuroepithelia are characterized by a mosaic of hair cells and supporting cells. Cochlear hair cells differentiate in four rows: a single row of inner hair cells (IHCs) and three rows of outer hair cells (OHCs). Recent studies have shown that Math1, a mammalian homolog of Drosophila atonal is a positive regulator of hair cell differentiation. The basic helix-loop-helix (bHLH) genes Hes1 and Hes5 (mammalian hairy and Enhancer-of-split homologs) can influence cell fate determination by acting as negative regulators to inhibit the action of bHLH-positive regulators. We show by using reverse transcription-PCR analysis that Hes1, Hes5, and Math1 are expressed in the developing mouse cochleae. In situ hybridization revealed a widespread expression of Hes1 in the greater epithelial ridge (GER) and in lesser epithelial ridge (LER) regions. Hes5 is predominantly expressed in the LER, in supporting cells, and in a narrow band of cells within the GER. Examination of cochleae from Hes1(-/-) mice showed a significant increase in the number of IHCs, whereas cochleae from Hes5(-/-) mice showed a significant increase in the number of OHCs. In the vestibular system, targeted deletion of Hes1 and to a lesser extent Hes5 lead to formation of supernumerary hair cells in the saccule and utricle. The supernumerary hair cells in the mutant mice showed an upregulation of Math1. These data indicate that Hes1 and Hes5 participate together for the control of inner ear hair cell production, likely through the negative regulation of Math1

Subset feedback vertex set is fixed parameter tractable

The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of at most k vertices that hits all simple cycles passing through S. Because of its applications in circuit testing and genetic linkage analysis SUBSET-FVS was studied from the approximation algorithms perspective by Even et al. [SICOMP'00, SIDMA'00]. The question whether the SUBSET-FVS problem is fixed-parameter tractable was posed independently by Kawarabayashi and Saurabh in 2009. We answer this question affirmatively. We begin by showing that this problem is fixed-parameter tractable when parametrized by |S|. Next we present an algorithm which reduces the given instance to 2^k n^O(1) instances with the size of S bounded by O(k^3), using kernelization techniques such as the 2-Expansion Lemma, Menger's theorem and Gallai's theorem. These two facts allow us to give a 2^O(k log k) n^O(1) time algorithm solving the Subset Feedback Vertex Set problem, proving that it is indeed fixed-parameter tractable.Comment: full version of a paper presented at ICALP'1